Hybrid GRASP Heuristics
نویسندگان
چکیده
Experience has shown that a crafted combination of concepts of different metaheuristics can result in robust combinatorial optimization schemes and produce higher solution quality than the individual metaheuristics themselves, especially when solving difficult real-world combinatorial optimization problems. This chapter gives an overview of different ways to hybridize GRASP (Greedy Randomized Adaptive Search Procedures) to create new and more effective metaheuristics. Several types of hybridizations are considered, involving different constructive procedures, enhanced local search algorithms, and memory structures.
منابع مشابه
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
The set multicovering or set k-covering problem is an extension of the classical set covering problem, in which each object is required to be covered at least k times. The problem finds applications in the design of communication networks and in computational biology. We describe a GRASP with pathrelinking heuristic for the set k-covering problem, as well as the template of a family of Lagrange...
متن کاملA Hybrid Grasp with Perturbations and Adaptive Path-relinking for the Steiner Problem in Graphs
We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the combination of several construction heuristics with a weight perturbation strategy that combines intensification and diversification elements, as in ...
متن کاملRestart strategies for GRASP with path-relinking heuristics
GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i1, i2, . . .} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local se...
متن کاملA grasp-knapsack hybrid for a nurse-scheduling problem
2 ABSTRACT This paper is concerned with the application of a GRASP approach to a nurse-scheduling problem in which the objective is to optimise a set of preferences subject to a set of binding constraints. The balance between feasibility and optimality is a key issue. This is addressed by using a knapsack model to ensure that the solutions produced by the construction heuristic are easy to repa...
متن کاملHeuristics and metaheuristics approaches used to solve the Rural Postman Problem: A Comparative Case Study
The Rural Postman Problem (RPP) consists of determining a minimum cost tour of a specified arc set of a graph (G=(V,A)) with the particularity that only a subset T (T ⊆ A) of arcs is required to be traversed at least once. The arcs can be directed, undirected or both. This problem appears in a variety of practical contexts like mail, fuel and newspaper deliveries, school bus routing, electrical...
متن کاملEfficient Hybrid Search Techniques For Circuit Partitioning
– Recently, four search approaches have emerged for handling complex combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search and Greedy Randomized Search Procedure (GRASP). Based on simple ideas, these heuristics have been extremely efficient in finding near-optimal or optimal solutions for many types of difficult problems [1]. In this paper we apply these appr...
متن کامل